New Insights on the Optimality Conditions of the $$\ell _2-\ell _0$$ Minimization Problem
نویسندگان
چکیده
منابع مشابه
the effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
A $2\ell k$ Kernel for $\ell$-Component Order Connectivity
In the `-Component Order Connectivity problem (` ∈ N), we are given a graph G on n vertices, m edges and a non-negative integer k and asks whether there exists a set of vertices S ⊆ V (G) such that |S| ≤ k and the size of the largest connected component in G−S is at most `. In this paper, we give a kernel for `-Component Order Connectivity with at most 2`k vertices that takes nO(`) time for eve...
متن کاملRecovery of sparsest signals via $\ell^q$-minimization
In this paper, it is proved that every s-sparse vector x ∈ R can be exactly recovered from the measurement vector z = Ax ∈ R via some l-minimization with 0 < q ≤ 1, as soon as each s-sparse vector x ∈ R n is uniquely determined by the measurement z.
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولThe UGC hardness threshold of the ℓp Grothendieck problem
For p ≥ 2 we consider the problem of, given an n×nmatrix A = (ai j) whose diagonal entries vanish, approximating in polynomial time the number Optp(A) B max n ∑ i, j=1 ai jxix j : (x1, . . . , xn) ∈ Rn ∧ n ∑ i=1 |xi| 1/p ≤ 1 . When p = 2 this is simply the problem of computing the maximum eigenvalue of A, while for p = ∞ (actually it suffices to take p ≈ log n) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Imaging and Vision
سال: 2019
ISSN: 0924-9907,1573-7683
DOI: 10.1007/s10851-019-00917-9